Full rank factorization in quasi- LDU form of totally nonpositive rectangular matrices
نویسندگان
چکیده
منابع مشابه
Totally nonpositive completions on partial matrices ∗ †
An n × n real matrix is said to be totally nonpositive if every minor is nonpositive. In this paper, we are interested in totally nonpositive completion problems, that is, does a partial totally nonpositive matrix have a totally nonpositive matrix completion? This problem has, in general, a negative answer. Therefore, we analyze the question: for which labeled graphs G does every partial totall...
متن کاملThe Condition Metric in the Space of Rectangular Full Rank Matrices
The condition metric in spaces of polynomial systems has been introduced and studied in a series of papers by Beltrán, Dedieu, Malajovich and Shub. The interest of this metric comes from the fact that the associated geodesics avoid ill-conditioned problems and are a useful tool to improve classical complexity bounds for Bézout’s theorem. The linear case is examined here: Using nonsmooth nonconv...
متن کاملSmall P-Groups with Full-Rank Factorization
The problem of determining which abelian groups admit a full-rank normalized factorization is settled for the orders 64 = 26, 81 = 34, and 128 = 27. By a computer-aided approach, it is shown that such groups of these orders are exactly those of type (22, 22, 22), (22, 22, 2, 2), (23, 22, 22), (23, 22, 2, 2), (22, 22, 22, 2), and (22, 22, 2, 2, 2). Mathematics Subject Classification (2000): Prim...
متن کاملA New Perturbation Bound for the LDU Factorization of Diagonally Dominant Matrices
This work introduces a new perturbation bound for the L factor of the LDU factorization of (row) diagonally dominant matrices computed via the column diagonal dominance pivoting strategy. This strategy yields L and U factors which are always well-conditioned and, so, the LDU factorization is guaranteed to be a rank-revealing decomposition. The new bound together with those for the D and U facto...
متن کاملA PLU-factorization of rectangular matrices by the Neville elimination
In this paper we prove that Neville elimination can be matricially described by elementary matrices. A PLU-factorization is obtained for any n×m matrix, where P is a permutation matrix, L is a lower triangular matrix (product of bidiagonal factors) and U is an upper triangular matrix. This result generalizes the Neville factorization usually applied to characterize the totally positive matrices...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2014
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.11.002